Algebraic Aspects of Controllability for Ar-systems
نویسنده
چکیده
This paper examines some aspects of controllability for behaviour systems in AR-representation. The approach is based on the theory of dipolynomial modules and dipolynomial matrices. Explicit criteria for controllability in terms of the representing matrices are derived and an eeective test algorithm is given. Furthermore, controllability indices are introduced for AR-systems. The new theory is compared to existing index concepts in the literature on linear systems.
منابع مشابه
Data under control
Controllability is a fundamental sanity check for open systems such as services. Existing approaches to check controllability consider Petri net models in which data aspects are usually neglected or abstracted from. This paper investigates controllability of algebraic Petri nets and sketches a symbolic analysis approach.
متن کاملON CONTROLLABILITY AND OBSERVABILITY OF FUZZY CONTROL SYSTEMS
In order to more effectively cope with the real world problems of vagueness, imprecise and subjectivity, fuzzy event systems were proposed recently. In this paper, we investigate the controllability and the observability property of two systems that one of them has fuzzy variables and the other one has fuzzy coefficients and fuzzy variables (fully fuzzy system). Also, sufficient conditions for ...
متن کاملControllability of switched differential-algebraic equations
We study controllability of switched differential algebraic equations. We are able to establish a controllability characterization where we assume that the switching signal is known. The characterization takes into account possible jumps induced by the switches. It turns out that controllability not only depends on the actual switching sequence but also on the duration between the switching times.
متن کاملA new perspective on criteria and algorithms for reachability of discrete-time switched linear systems
The paper presents a unified perspective on geometric and algebraic criteria for reachability and controllability of controlled switched linear discrete-time systems. Direct connections between geometric and algebraic criteria are established as well as that between the subspace based controllability/reachability algorithmandKalman-type algebraic rank criteria. Also the existing geometric crite...
متن کاملOn Controllability and Near-controllability of Multi-input Discrete-time Bilinear Systems in Dimension Two
This paper completely solves the controllability problems of two-dimensional multi-input discrete-time bilinear systems with and without drift. Necessary and sufficient conditions for controllability, which cover the existing results, are obtained by using an algebraic method. Furthermore, for the uncontrollable systems, near-controllability is studied and necessary and sufficient conditions fo...
متن کامل